Reduction of absorbing Markov chain
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولOn PageRank Algorithm and Markov Chain Reduction
The PageRank is used by search engines to reflect the popularity and importance of a page based on its reference ranking. Since the web changes very fast, the PageRank has to be regularly updated. Such updates is an challenging task due to the huge size of the World Wide Web. Consequently, the analysis of the PageRank has become a hot topic with vast literature ranging from the original paper b...
متن کاملDesigning Fast Absorbing Markov Chains
Markov Chains are a fundamental tool for the analysis of real world phenomena and randomized algorithms. Given a graph with some specified sink nodes and an initial probability distribution, we consider the problem of designing an absorbing Markov Chain that minimizes the time required to reach a sink node, by selecting transition probabilities subject to some natural regularity constraints. By...
متن کاملAbsorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping
In this paper, absorbing Markov chain models are developed to determine the optimum process mean levels for both a single-stage and a serial two-stage production system in which items are inspected for conformity with their specification limits. When the value of the quality characteristic of an item falls below a lower limit, the item is scrapped. If it falls above an upper limit, the item is ...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Mathematica
سال: 2009
ISSN: 0365-1029
DOI: 10.2478/v10062-009-0009-7